Papers with knowledge graph completion
SpeedE: Euclidean Geometric Knowledge Graph Embedding Strikes Back (2024.findings-naacl)
Copied to clipboard
| Challenge: | Geometric knowledge graph embedding models (gKGEs) have shown great potential for knowledge graph completion (KGC) however, contemporary gKges require high embeddable dimensionalities or complex embeddances for good KGC performance, drastically limiting their time and space efficiency. |
| Approach: | They propose a lightweight Euclidean gKGE that provides strong inference capabilities and significantly outperforms state-of-the-art gGKGEs. |
| Outcome: | The proposed model outperforms state-of-the-art gKGEs on YAGO3-10 and WN18RR while significantly increasing their efficiency. |
Bilateral Masking with prompt for Knowledge Graph Completion (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing word matching methods fail to obtain satisfactory single embedding representations for entities. |
| Approach: | They propose a bi-encoder-based approach to enhance entity representations by using prompts to narrow the distance between the predicted entity and the known entity. |
| Outcome: | The proposed model achieves state-of-the-art performance on the WN18RR dataset. |
Contextualization Distillation from Large Language Model for Knowledge Graph Completion (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models lack textual information, which limits their performance . a plug-in-and-play approach is needed to train small models in descriptive context . |
| Approach: | They propose a plug-in-and-play approach to knowledge graph completion that prompts LLMs to generate descriptive context. |
| Outcome: | The proposed method improves performance on Wikipedia articles and synset definitions. |
Hyper-CL: Conditioning Sentence Representations with Hypernetworks (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to sentence embeddings do not capture fine-grained semantics of sentences. |
| Approach: | They propose a method that integrates hypernetworks with contrastive learning to generate conditioned sentence representations. |
| Outcome: | The proposed method narrows the performance gap with the bi-encoder architecture while maintaining the time efficiency characteristic of the tri-encoding approach. |
Neural Tensor Networks with Diagonal Slice Matrices (N18-1)
Copied to clipboard
| Challenge: | A large number of parameters can cause overfitting and a long training time for neural tensor networks (NTNs). |
| Approach: | They propose two new parameter reduction techniques to reduce the number of parameters in an NTN without diminishing its expressiveness. |
| Outcome: | The proposed models learn better and faster than the original (R)NTNs. |
RatE: Relation-Adaptive Translating Embedding for Knowledge Graph Completion (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches for knowledge graph embedding have limitations in complex vector space . embeddability of one-to-many relations is not explicitly alleviated . |
| Approach: | They propose a relation-adaptive translating embedding function that can be extended to complex vector space. |
| Outcome: | The proposed translation function improves expressive power and alleviates embedding ambiguity problem. |
Multi-view Classification Model for Knowledge Graph Completion (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models only evaluated candidate triples from content information. |
| Approach: | They propose a multi-view classification model where multiple views are performed based on both content and context information for candidate triple evaluation. |
| Outcome: | The proposed model improves on two representative datasets and improves performance. |
Don’t Mess with Mister-in-Between: Improved Negative Search for Knowledge Graph Completion (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph completion use a dual-encoding framework with a bottleneck that allows for fast approximate search over a vast collection of candidates. |
| Approach: | They propose to use a dual-encoder framework to find more informative negatives by searching for candidates with high lexical overlaps. |
| Outcome: | The proposed methods improve on the large-scale Wikidata5M dataset and combine different kinds of strategies to achieve state-of-the-art performance. |
Self-Distillation with Meta Learning for Knowledge Graph Completion (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph completion frameworks for knowledge graphs are far from complete and require missing triples to be added to them. |
| Approach: | They propose a dynamic pruning technique to obtain a pruned model from a large source model, where the pruning mask of the pruned models could be updated adaptively per epoch after the model weights are updated. |
| Outcome: | The proposed framework achieves competitive performance compared to strong baselines, while being 10x smaller than baselines. |
Counterfactual Reasoning with Knowledge Graph Embeddings (2024.eacl-long)
Copied to clipboard
| Challenge: | Knowledge graph embeddings were originally developed to infer true but missing facts in incomplete knowledge repositories. |
| Approach: | They propose a task that requires models to reason on a counterfactual KG. |
| Outcome: | The proposed task connects knowledge graph completion and counterfactual reasoning. |
Joint Language Semantic and Structure Embedding for Knowledge Graph Completion (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to complete knowledge triplets rely on structures or semantics, but use semantics to improve performance. |
| Approach: | They propose to embed semantics in the natural language description of knowledge triplets with their structure information. |
| Outcome: | The proposed method improves performance on knowledge graph benchmarks and on low-resource regimes. |
Retrofitting Distributional Embeddings to Knowledge Graphs with Functional Relations (C18-1)
Copied to clipboard
| Challenge: | Existing methods for retrofitting knowledge graph embeddings assume connected entities have similar embeddments, but these assumptions are not true for large knowledge graphs. |
| Approach: | They propose to retrofit distributional and relational data to a knowledge graph structure . they propose to explicitly model pairwise relations to overcome these limitations . |
| Outcome: | The proposed framework outperforms existing retrofitting methods on complex knowledge graphs and loses no accuracy on simpler graphs. |
CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion (2022.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques rely on fact-view data to predict missing links between entities, limiting their performance. |
| Approach: | They propose a commonsense-aware knowledge embedding framework which generates commonsensense from factual triples with entity concepts for a KGC task. |
| Outcome: | The proposed framework could produce high-quality negative triples and joint commonsense and fact-view link prediction. |
One-Shot Relational Learning for Knowledge Graphs (D18-1)
Copied to clipboard
| Challenge: | Existing studies on knowledge graph completion require a large number of positive examples for each relation, but long-tail relations are more common in KGs and those newly added relations do not have many known triples for training. |
| Approach: | They propose a one-shot relational learning framework that utilizes the knowledge distilled by embedding models and learns a matching metric by considering both the learned embeddments and one-hop graph structures. |
| Outcome: | The proposed framework improves on existing embedding models and eliminates the need for retraining when dealing with newly added relations. |
A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization (N19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs with billions of triples are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose to embed relationship triples into a capsule network using a convolution layer and multiple filters to generate feature maps. |
| Outcome: | The proposed model outperforms strong search personalization baselines on two benchmark datasets and outperformed previous state-of-the-art models on WN18RR and FB15k-237. |
SiMFy: A Simple Yet Effective Approach for Temporal Knowledge Graph Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability. |
| Approach: | They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference. |
| Outcome: | The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability. |
Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to predict knowledge base relations are limited by maintenance costs and text-based formats. |
| Approach: | They propose a system that can extend relational database tables with information extracted from a document corpus. |
| Outcome: | The proposed system outperforms existing methods by incorporating embeddings of text-based representations of the entities and relations. |
NeuSTIP: A Neuro-Symbolic Model for Link and Time Prediction in Temporal Knowledge Graphs (2023.emnlp-main)
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (KGs) are factual information repositories where a fact is associated with a time interval. |
| Approach: | They propose a temporal NS model for knowledge graph completion that performs link prediction and time interval prediction in a TKG. |
| Outcome: | The proposed model shows competitive performance on link prediction and time prediction. |
Adapters for Enhanced Modeling of Multilingual Knowledge and Text (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models learn facts from text corpora, but knowledge graphs contain facts in an explicit triple format, restricting their research and application. |
| Approach: | They propose to enhance multilingual language models with knowledge from multilingual knowledge graphs . they propose to use cross-lingual entity alignment and facts from MLKGs to improve performance . |
| Outcome: | The proposed model improves MLLMs with cross-lingual entity alignment and facts from multilingual knowledge graphs for many languages while maintaining performance on other general language tasks. |
To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
Rui Li, Xu Chen, Chaozhuo Li, Yanming Shen, Jianan Zhao, Yujing Wang, Weihao Han, Hao Sun, Weiwei Deng, Qi Zhang, Xing Xie
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
A2N: Attending to Neighbors for Knowledge Graph Inference (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods learn a fixed embedding for every entity, which is suboptimal as it requires memorizing and generalizing to all possible entity relationships. |
| Approach: | They propose a method which learns query-dependent representations of entities by combining relevant neighborhood of an entity. |
| Outcome: | The proposed model performs competitively or better than existing state-of-the-art models for knowledge graph completion. |
Advancing Cross-Lingual Entity Alignment with Large Language Models: Tailored Sample Segmentation and Zero-Shot Prompts (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to integrate large language models into cross-lingual entity alignment tasks pose challenges in handling large-scale data, generating suitable data samples, and adapting prompts for the EA task. |
| Approach: | They propose a framework that integrates distance feature extraction, sample **Seg**mentation, and zero-shot prompts to integrate LLMs into cross-lingual entity alignment tasks. |
| Outcome: | The proposed framework is able to extract features from large-scale data and adapt prompts to the task. |
Knowledge Context Modeling with Pre-trained Language Models for Contrastive Knowledge Graph Completion (2024.findings-acl)
Copied to clipboard
| Challenge: | Text-based knowledge graph completion methods neglect knowledge contexts in inferring process. |
| Approach: | They propose a framework which models the knowledge context as additional prompts with pre-trained language models for knowledge graph completion. |
| Outcome: | The proposed framework achieves state-of-the-art on FB15k-237, WN18RR and Wikidata5M datasets. |
Connecting Embeddings for Knowledge Graph Entity Typing (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incompleteness and miss important facts, jeopardizing their usefulness in downstream tasks such as question answering. |
| Approach: | They propose a method which is trained by utilizing local typing knowledge from existing entity type assertions and global triple knowledge in KGs. |
| Outcome: | The proposed model favors inferences that agree with both entity type instances and triple knowledge in KGs. |
TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods restrict entities on hyper-ellipsoid surfaces, resulting in suboptimal knowledge graph completion. |
| Approach: | They propose a score function that leverages relation-specific translations between head and tail entities to relax constraints on hyper-ellipsoid surfaces. |
| Outcome: | The proposed method achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. |
Filter-then-Generate: Large Language Models with Structure-Text Adapter for Knowledge Graph Completion (2025.coling-main)
Copied to clipboard
| Challenge: | Empirical evidence suggests that LLMs perform worse than conventional KGC approaches. |
| Approach: | They propose a filter-then-generate paradigm and a multiple-choice question format to harness the capability of LLMs while mitigating the issue casused by hallucinations. |
| Outcome: | The proposed method achieves substantial performance gain compared to existing state-of-the-art methods. |
Less Is MuRE: Revisiting Shallow Knowledge Graph Embeddings (2025.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graphs encode knowledge in the form of subject-predicate-object triples, which is notoriously incomplete. |
| Approach: | They propose a framework for analyzing existing shallow knowledge graph models and their extensions. |
| Outcome: | The proposed framework shows that MuRE and ExpressivE are highly competitive . it can capture the same class of rule bases as state-of-the-art region-based embedding models. |
Complex Logical Query Answering by Calibrating Knowledge Graph Completion Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to solve complex logical queries are not well-calibrated . CKGC is lightweight and effective, allowing the model to quickly converge . |
| Approach: | They propose a method for calibrating KGC models to adapt to complex logical queries . they map the values of predictions of KGC to the range [0, 1] . |
| Outcome: | The proposed method can significantly boost model performance in complex logical query answering task. |
KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) is a critical task to predict missing facts among entities. |
| Approach: | They propose a knowledge-constrained generative re-ranking method based on generative large language models for KGC that can predict missing facts among entities. |
| Outcome: | The proposed method achieves state-of-the-art performance on four datasets and 9.0% and 11.1% compared to the previous methods. |
Double-Branch Multi-Attention based Graph Neural Network for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods cannot capture local and global information and are not designed well to learn representations of seen entities with sparse neighborhoods in isolated subgraphs. |
| Approach: | They propose a double-branch multi-attention based graph neural network to learn more expressive entity representations which contain rich global-local structural information. |
| Outcome: | The proposed method outperforms a general GNN-based approach for KGC. |
Knowledge GeoGebra: Leveraging Geometry of Relation Embeddings in Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding models are limited to the algebra and geometry of the entity embeddable space, the algebra of the relation embeddible space, and the interaction between relation and entity embeds. |
| Approach: | They propose a method that leverages the geometry of relation embeddings and generalizes it with the concept of a butterfly curve, consecutively. |
| Outcome: | The proposed model outperforms existing models on the WN18RR, FB15K-237 and YouTube benchmarks. |
Structure-Aware Zero-Shot Relational Learning for Knowledge Graphs without External Knowledge (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for Zero-shot Relational Learning depend on external knowledge, resulting in increased annotation costs and limited practical applicability. |
| Approach: | They propose a structure-aware paradigm that performs ZRL without external knowledge . it leverages intrinsic structural patterns in KGs to bridge semantic correlations for new relations with existing ones. |
| Outcome: | The proposed paradigm achieves 10.66% improvement in MRR while reducing annotation costs and enhancing practical applicability on three real-world benchmarks. |
Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning (2025.findings-acl)
Copied to clipboard
Yin Hua, Zhiqiang Liu, Mingyang Chen, Zheng Fang, Chi Man Wong, Lingxiao Li, Chi Man Vong, Huajun Chen, Wen Zhang
| Challenge: | Existing foundation models for general knowledge graph reasoning have focused on their structural aspects, with most efforts restricted to in-KG tasks. |
| Approach: | They propose a conditional encoding architecture that bridges the gap between textual and structural modalities, enabling seamless integration. |
| Outcome: | The proposed model outperforms baseline models on 28 datasets and is generalized to out-of-KG tasks. |
MAKI: Multi-layer Aligned Knowledge Injection for Structure-aware Knowledge Graph Completion with Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods struggle to capture structural information in knowledge graphs (KGs) Existing approaches for KGC focus on learning representations of entities and relations through observed structural patterns. |
| Approach: | They propose a multi-layer Aligned Knowledge Injection model that tightly integrates structured KG information into LLMs through multi-layered alignment. |
| Outcome: | The proposed method outperforms state-of-the-art methods on benchmark datasets. |